def is_p(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:
return i
return True
for i in range(int(input())):
n = int(input())
imp = is_p(n)
if n%2==0:
print(n//2,n//2)
elif imp==True:
print(1,n-1)
else:
x = n//imp
print(x,((n//x-1)*(x)))#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007;
bool prime(ll x)
{
for(ll i=2;i<=sqrt(x);i++)
{
if(x%i==0) return false;
}
return true;
}
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
if(n%2==0)
{
cout<<n/2<<" "<<n/2<<endl;
}
else if(prime(n)){
cout<<1<<" "<<n-1<<endl;
}
else {
for(int i=2;i<=n-1;i++)
{
if(n%i==0)
{
cout<<(n/i)<<" "<<n-(n/i)<<endl;
break;
}
}
}
}
}1547C - Pair Programming | 550A - Two Substrings |
797B - Odd sum | 1093A - Dice Rolling |
1360B - Honest Coach | 1399C - Boats Competition |
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |
1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |